Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases

نویسندگان

  • Hwan-Seung Yong
  • Sukho Lee
  • Hyoung-Joo Kim
چکیده

Forward traversal methods are used to process queries having nested predicates in object-oriented databases. To expedite the forward traversal, a signature replication technique is proposed. Object signature is a signature formed b y values of all atomic attributes defined in the object. When an object refers to other objects through its attribute, the object signature of the referred object is stored into the referring object Using object signatures, nested predicates can be checked without inspecting referred objects.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applying SD-Tree for Object-Oriented query processing

We follow signature-based approach to object-oriented query handling in this paper. The use of signature files as an index for full text search has been widely known and used. Signature file based access methods initially applied on text have now been used to handle set-oriented queries in ObjectOriented Data Bases (OODB). All the proposed methods use either efficient search method or tree base...

متن کامل

Path Dictionary: A New Approach to Query Processing in Object-Oriented Databases

We present a new access method, called the path dictionary index (PDI) method, for supporting nested queries on object-oriented databases. PDI supports object traversal and associative search, respectively, with a path dictionary and a set of attribute indexes built on top of the path dictionary. We discuss issues on indexing and query processing in object-oriented databases, describe the opera...

متن کامل

Dictionary: A New Access Method for Query Processing in Object-Oriented Databases

We present a new access method, called the path dictionary index (PDI) method, for supporting nested queries on object-oriented databases. PDI supports object traversal and associative search, respectively, with a path dictionary and a set of attribute indexes built on top of the path dictionary. We discuss issues on indexing and query processing in object-oriented databases; describe the opera...

متن کامل

Join Index Hierarchy: An Indexing Structure for Efficient Navigation in Object-Oriented Databases

A novel indexing structure, join index hierarchy, is proposed to handle the \goto's on disk" problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index le, and thus accelerates navigation in object-oriented databases. The method extends the join index str...

متن کامل

OID : 4 Name : Fortran

A novel indexing structure, join index hierarchy, is proposed to handle the \goto's on disk" problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index le, and thus accelerates navigation in object-oriented databases. The method extends the join index str...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994